On a Combinatorial Problem
نویسنده
چکیده
Let M be a set and F a family of its subsets. F is said by E. W. MILLER [5] to possess property B if there exists a subset K of M so that no set of the family F is contained either in K or in K (K is the complement of K in M) . HAJNAL and 1 [2] recently published a paper on the property B and its generalisations . One of the unsolved problems we state asks : What is the smallest integer in (n) for which there exists a family F of sets A 1 , . . ., A ( „ ) each having n elements which does not possess property B? Throughout this paper A 1 will denote sets having n elements .
منابع مشابه
Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction
In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...
متن کاملThe Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملFORM FINDING FOR RECTILINEAR ORTHOGONAL BUILDINGS THROUGH CHARGED SYSTEM SEARCH ALGORITHM
Preliminary layout design of buildings has a substantial effect on the ultimate design of structural components and accordingly influences the construction cost. Exploring structurally efficient forms and shapes during the conceptual design stage of a project can also facilitate the optimum integrated design of buildings. This paper presents an automated method of determining column layout desi...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کامل